New general mixed-integer linear programming model for mobile workforce management

Abstract A mathematical model is introduced to solve a mobile workforce management problem. In such problem there are number of tasks be executed at different locations by various teams. For example, when an electricity utility company has deal with planned system upgrades and damages caused storms. The aim determine the schedule teams in way that overall cost minimal. involves scheduling. following questions should answered: perform task, how route vehicles—the vehicle routing problem—and order sites visited which These problems already complex themselves. This paper proposes integrated programming formulation, which, assignment its binary variables, can easily included heuristic algorithmic frameworks. specification, wide range parameters set. includes absolute expected time windows for tasks, packing unpacking case team movement, resource utilization, relations between as precedence, mutual exclusion or parallel execution, team-dependent travelling execution times costs. To make able larger problems, framework also implemented used find solutions acceptable time. latter solution method alternative. Computational performance examined through series test cases most important factors scaled.